Use of collateral information to improve LANDSAT classification accuracies

There are no author-identified significant results in this report

FOCIS: A forest classification and inventory system using LANDSAT and digital terrain data

Accurate, cost-effective stratification of forest vegetation and timber inventory is the primary goal of a Forest Classification and Inventory System (FOCIS). Conventional timber stratification using photointerpretation can be time-consuming, costly, and inconsistent from analyst to analyst. FOCIS was designed to overcome these problems by using machine processing techniques to extract and process tonal, textural, and terrain information from registered LANDSAT multispectral and digital terrain data. Comparison of samples from timber strata identified by conventional procedures showed that both have about the same potential to reduce the variance of timber volume estimates over simple random sampling

Preliminary evaluation of the airborne imaging spectrometer for vegetation analysis

The primary goal of the project was to provide ground truth and manual interpretation of data from an experimental flight of the Airborne Infrared Spectrometer (AIS) for a naturally vegetated test site. Two field visits were made; one trip to note snow conditions and temporally related vegetation states at the time of the sensor overpass, and a second trip following acquisition of prints of the AIS images for field interpretation. Unfortunately, the ability to interpret the imagery was limited by the quality of the imagery due to the experimental nature of the sensor

The branching structure of diffusion-limited aggregates

I analyze the topological structures generated by diffusion-limited aggregation (DLA), using the recently developed "branched growth model". The computed bifurcation number B for DLA in two dimensions is B ~ 4.9, in good agreement with the numerically obtained result of B ~ 5.2. In high dimensions, B -> 3.12; the bifurcation ratio is thus a decreasing function of dimensionality. This analysis also determines the scaling properties of the ramification matrix, which describes the hierarchy of branches.Comment: 6 pages, 1 figure, Euro-LaTeX styl

Monitoring global vegetation

An attempt is made to identify the need for, and the current capability of, a technology which could aid in monitoring the Earth's vegetation resource on a global scale. Vegetation is one of our most critical natural resources, and accurate timely information on its current status and temporal dynamics is essential to understand many basic and applied environmental interrelationships which exist on the small but complex planet Earth

Preliminary evaluation of the airborne imaging spectrometer for vegetation analysis in the Klamath National Forest of northeastern California

The experiences and results associated with a project entitled Preliminary Evaluation of the Airborne Imaging Spectrometer for Vegetation Analysis is documented. The primary goal of the project was to provide ground truth, manual interpretation, and computer processing of data from an experimental flight of the Airborne Infrared Spectrometer (AIS) to determine the extent to which high spectral resolution remote sensing could differentiate among plant species, and especially species of conifers, for a naturally vegetated test site. Through the course of the research, JPL acquired AIS imagery of the test areas in the Klamath National Forest, northeastern California, on two overflights of both the Dock Well and Grass Lake transects. Over the next year or so, three generations of data was also received: first overflight, second overflight, and reprocessed second overflight. Two field visits were made: one trip immediately following the first overflight to note snow conditions and temporally-related vegetation states at the time of the sensor overpass; and a second trip about six weeks later, following acquisition of prints of the images from the first AIS overpass

Information Gathering in Ad-Hoc Radio Networks with Tree Topology

We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complete this task within its allotted time even though the actual tree topology is unknown when the computation starts. In the deterministic case, assuming that the nodes are labeled with small integers, we give an O(n)-time protocol that uses unbounded messages, and an O(n log n)-time protocol using bounded messages, where any message can include only one rumor. We also consider fire-and-forward protocols, in which a node can only transmit its own rumor or the rumor received in the previous step. We give a deterministic fire-and- forward protocol with running time O(n^1.5), and we show that it is asymptotically optimal. We then study randomized algorithms where the nodes are not labelled. In this model, we give an O(n log n)-time protocol and we prove that this bound is asymptotically optimal

Unified View of Scaling Laws for River Networks

Scaling laws that describe the structure of river networks are shown to follow from three simple assumptions. These assumptions are: (1) river networks are structurally self-similar, (2) single channels are self-affine, and (3) overland flow into channels occurs over a characteristic distance (drainage density is uniform). We obtain a complete set of scaling relations connecting the exponents of these scaling laws and find that only two of these exponents are independent. We further demonstrate that the two predominant descriptions of network structure (Tokunaga's law and Horton's laws) are equivalent in the case of landscapes with uniform drainage density. The results are tested with data from both real landscapes and a special class of random networks.Comment: 14 pages, 9 figures, 4 tables (converted to Revtex4, PRE ref added

On the topological classification of binary trees using the Horton-Strahler index

The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various species of trees) and computational (use of registers) applications. Here we revisit the enumeration problem of the HS index on the rooted, unlabeled, plane binary set of trees, and enumerate the same index on the ambilateral set of rooted, plane binary set of trees of $n$ leaves. The ambilateral set is a set of trees whose elements cannot be obtained from each other via an arbitrary number of reflections with respect to vertical axes passing through any of the nodes on the tree. For the unlabeled set we give an alternate derivation to the existing exact solution. Extending this technique for the ambilateral set, which is described by an infinite series of non-linear functional equations, we are able to give a double-exponentially converging approximant to the generating functions in a neighborhood of their convergence circle, and derive an explicit asymptotic form for the number of such trees.Comment: 14 pages, 7 embedded postscript figures, some minor changes and typos correcte

Topological self-similarity on the random binary-tree model

Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary tree, and derive a recursive equation about branch orders. As an application of the analysis, topological self-similarity and its generalization is proved in an asymptotic sense. Also, some important examples are presented